Towards Cluster-Based Prototype Sets for Classification in the Dissimilarity Space
نویسندگان
چکیده
The selection of prototypes for the dissimilarity space is a key aspect to overcome problems related to the curse of dimensionality and computational burden. How to properly define and select the prototypes is still an open issue. In this paper, we propose the selection of clusters as prototypes to create low-dimensional spaces. Experimental results show that the proposed approach is useful in the problems presented. Especially, the use of the minimum distances to clusters for representation provides good results.
منابع مشابه
Composite Kernel Optimization in Semi-Supervised Metric
Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...
متن کاملOn using prototype reduction schemes to optimize dissimilarity-based classification
The aim of this paper is to present a strategy by which a new philosophy for pattern classification, namely that pertaining to dissimilaritybased classifiers (DBCs), can be efficiently implemented. This methodology, proposed by Duin and his co-authors (see Refs. [Experiments with a featureless approach to pattern recognition, Pattern Recognition Lett. 18 (1997) 1159–1166; Relational discriminan...
متن کاملNeural Gas Clustering for Dissimilarity Data with Continuous Prototypes
Prototype based neural clustering or data mining methods such as the self-organizing map or neural gas constitute intuitive and powerful machine learning tools for a variety of application areas. However, the classical methods are restricted to data embedded in a real vector space and have only limited applicability to noneuclidean data as occurs in, for example, biomedical or symbolic fields. ...
متن کاملOn Using Class-dependent Principle Component Analysis for Dissimilarity-Based Classifications
The aim of this paper 1 is to present an empirical evaluation on using class-dependent principle component analysis (PCA) for dissimilarity-based classifications (DBC) [18]. In DBC, the classification performance relies heavily on how well the dissimilarity space is constructed. In this paper, we study a way of constructing it in eigenspaces, spanned by the subset of principal eigenvectors, ext...
متن کاملOn Optimizing Dissimilarity-Based Classification Using Prototype Reduction Schemes
The aim of this paper is to present a strategy by which a new philosophy for pattern classification, namely that pertaining to Dissimilarity-Based Classifiers (DBCs), can be efficiently implemented. This methodology, proposed by Duin and his co-authors (see [3], [4], [5], [6], [8]), is a way of defining classifiers between the classes, and is not based on the feature measurements of the individ...
متن کامل